Semi-regular graphs of minimum independence number
نویسندگان
چکیده
منابع مشابه
Semi-regular graphs of minimum independence number
There are many functions of the degree sequence of a graph which give lower bounds on the independence number of the graph. In particular, for every graph G, α(G) ≥ R(d(G)), where R is the residue of the degree sequence of G. We consider the precision of this estimate when it is applied to semi-regular degree sequences. We show that the residue nearly always gives the best possible estimate on ...
متن کاملMinimum Number of k-Cliques in Graphs with Bounded Independence Number
Let us give some definitions first. As usual, a graph G is a pair (V (G), E(G)), where V (G) is the vertex set and the edge set E(G) consists of unordered pairs of vertices. An isomorphism between graphs G and H is a bijection f : V (G) → V (H) that preserves edges and non-edges. For a graph G, let G = ( V (G), ( V (G) 2 ) \E(G) ) denote its complement and let v(G) = |V (G)| denote its order. F...
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملStrongly Regular Semi-Cayley Graphs
We consider strongly regular graphs r = (V, E) on an even number, say 2n, of vertices which admit an automorphism group G of order n which has two orbits on V. Such graphs will be called strongly regular semi-Cayley graphs. For instance, the Petersen graph, the Hoffman-Singleton graph, and the triangular graphs T(q) with q = 5 mod 8 provide examples which cannot be obtained as Cayley graphs. We...
متن کاملApproximating the Minimum Maximal Independence Number
We consider the problem of approximating the size of a minimum non-extendible independent set of a graph, also known as the minimum dominating independence number. We strengthen a result of Irving [2] to show that there is no constant > 0 for which this problem can be approximated within a factor of n 10 in polynomial time, unless P = NP. This is the strongest lower bound we are aware of for po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2004
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(03)00109-2